/* 1047:Round and Round We Go */
/*
描述
A cyclic number is an integer n digits in length which, when multiplied by any integer from 1 to n, yields a"cycle"of the digits of the original number. That is, if you consider the number after the last digit to "wrap around"back to the first digit, the sequence of digits in both numbers will be the same, though they may start at different positions.For example, the number 142857 is cyclic, as illustrated by the following table:
142857	*1	=	142857
142857	*2	=	285714
142857	*3	=	428571
142857	*4	=	571428
142857	*5	=	714285
142857	*6	=	857142
输入
Write a program which will determine whether or not numbers are cyclic. The input file is a list of integers from 2 to 60 digits in length. (Note that preceding zeros should not be removed, they are considered part of the number and count in determining n. Thus, "01"is a two-digit number, distinct from "1" which is a one-digit number.)
输出
For each input integer, write a line in the output indicating whether or not it is cyclic.
*/


#include<stdio.h>
#include<string.h>
int len;

int mult(int *num,int *temp,int n)
{
    int i,t=0;
    for(i=0;i<len;++i)
    {
        t=num[i]*n+t;
        temp[i]=t%10;
        t/=10;
    }
    if(t)
        return 0;
    return 1;
}

int Judge(int *num,int *temp)
{
    int i,j,k;
    for(i=0;i<len;++i)
    {
        k=0;
        if(temp[i]==num[0])
        {
            j=i;
            while(k<len&&num[++k]==temp[(++j)%len]);
            if(k==len)
                return 1;
        }
    }
    return 0;
}

int main()
{
    char s[65];
    int num[65];
    int temp[65];
    int i,j,flag;
    while(gets(s))
    {
        flag=1;
        len=strlen(s);
        memset(num,0,sizeof(num));
        for(i=len-1,j=0;i>=0;--i)
            num[j++]=s[i]-'0';
        for(i=2;i<=len;++i)
        {
            memset(temp,0,sizeof(temp));
            if(mult(num,temp,i))
            {
                if(Judge(num,temp)==0)
                {
                    printf("%s is not cyclic\n",s);
                    flag=0;
                    break;
                }
            }
            else
            {
                printf("%s is not cyclic\n",s);
                flag=0;
                break;
            }

        }
        if(flag)
            printf("%s is cyclic\n",s);
    }
    return 0;
}

//  Accepted

/*
 //方法二
#include <iostream>
#include <string.h>
using namespace std;
char s[100];
int a[100];
int main()
{
    while (cin>>s)
    {
        int len=strlen(s);
        memset(a,0,sizeof(a));
        int k=0,left=0;
        for (int i=len-1;i>=0;i--)
        {
            int ans=(s[i]-'0')*(len+1)+left;
            a[k++]=ans%10;
            left=ans/10;
        }
        while (left!=0)
        {
            a[k++]=left%10;
            left/=10;
        }
        int flag=0;
        for (int i=0;i<k;i++)
        {
            if (a[i]!=9)
            {
                flag=1;
                break;
            }
        }
        if (flag==1)
            cout<<s<<" is not cyclic"<<endl;
        else
            cout<<s<<" is cyclic"<<endl;
    }
    return 0;
}
// Accepted
 */
